A Study of Ant Colony Optimization Algorithms for a Biobjective Permutation Flowshop Problem
نویسندگان
چکیده
In this article, we present a study that compares variants of two ACO algorithms designed to tackle a biobjective permutation flowshop scheduling problem where the makespan and the total tardiness are the objectives considered. These two algorithms use respectively one and two pheromone matrices. The analysis of the results gives indications on the choices to adopt when designing an ACO approach for biobjective flowshop scheduling.
منابع مشابه
Native metaheuristics for non-permutation flowshop scheduling
The most general flowshop scheduling problem is also addressed in the literature as nonpermutation flowshop (NPFS). Current processors are able to cope with the (n!) m combinatorial complexity of non-permutation flowshop scheduling by metaheuristics. After briefly discussing the requirements for a manufacturing layout to be designed and modeled as non-permutation flowshop, a disjunctive graph (...
متن کاملAnt-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
The problem of scheduling in permutation flowshops is considered with the objective of minimizing the makespan, followed by the consideration of minimization of total flowtime of jobs. Two ant-colony optimization algorithms are proposed and analyzed for solving the permutation flowshop scheduling problem. The first algorithm extends the ideas of the ant-colony algorithm by Stuetzle [Proceedings...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملNonpermutation flow line scheduling by ant colony optimization
A flow line is a conventional manufacturing system where all jobs must be processed on all machines with the same operation sequence. Line buffers allow non-permutation flowshop scheduling (NPFS) and job sequences to be changed on different machines. A mixed-integer linear programming model for non-permutation flowshop scheduling and the buffer requirement along with manufacturing implication i...
متن کاملTabu Search with two approaches to parallel flowshop evaluation on CUDA platform
The introduction of NVidia’s powerful Tesla GPU hardware and Compute Unified Device Architecture (CUDA) platform enable many-core parallel programming. As a result, existing algorithms implemented on a GPU can run many times faster than on modern CPUs. Relatively little research has been done so far on GPU implementations of discrete optimisation algorithms. In this paper, two approaches to par...
متن کامل